Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem
نویسندگان
چکیده
منابع مشابه
New bounds on the unconstrained quadratic integer programming problem
We consider the maximization γ = max{xTAx : x ∈ {−1, 1}n} for a given symmetric A ∈ Rn×n . It was shown recently, using properties of zonotopes and hyperplane arrangements, that in the special case that A has a small rank, so that A = V V T where V ∈ Rn×m with m < n, then there exists a polynomial time algorithm (polynomial in n for a given m) to solve the problem max{xT V V T x : x ∈ {−1, 1}n}...
متن کاملUnconstrained inverse quadratic programming problem
The paper covers a formulation of the inverse quadratic programming problem in terms of unconstrained optimization where it is required to find the unknown parameters (the matrix of the quadratic form and the vector of the quasi-linear part of the quadratic form) provided that approximate estimates of the optimal solution of the direct problem and those of the target function to be minimized in...
متن کاملOptimization procedures for the bipartite unconstrained 0-1 quadratic programming problem
The bipartite unconstrained 0-1 quadratic programming problem (BQP) is a difficult combinatorial problem defined on a complete graph that consists of selecting a subgraph that maximizes the sum of the weights associated with the chosen vertices and the edges that connect them. The problem has appeared under several different names in the literature, including maximum weight induced subgraph, ma...
متن کاملHeuristic algorithms for the bipartite unconstrained 0-1 quadratic programming problem
We study the Bipartite Unconstrained 0-1 Quadratic Programming Problem (BQP) which is a relaxation of the Unconstrained 0-1 Quadratic Programming Problem (QP). Applications of the BQP include mining discrete patterns from binary data, approximating matrices by rank-one binary matrices, computing cut-norm of a matrix, and solving optimization problems such as maximum weight biclique, bipartite m...
متن کاملA New Approach for Solving Interval Quadratic Programming Problem
This paper discusses an Interval Quadratic Programming (IQP) problem, where the constraints coefficients and the right-hand sides are represented by interval data. First, the focus is on a common method for solving Interval Linear Programming problem. Then the idea is extended to the IQP problem. Based on this method each IQP problem is reduced to two classical Quadratic Programming (QP) proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2006
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-005-0637-9